• Conference Object  

      Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2002)
      The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
    • Article  

      The complexity of synchronous iterative Do-All with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2004)
      The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
    • Article  

      The complexity of synchronous iterative do-all with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2001)
      Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [8]. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have ...
    • Conference Object  

      Distributed Cooperation and Adversity: Complexity Trade-Offs 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2003)
      The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...
    • Article  

      The Do-All problem with Byzantine processor failures 

      Fernández, A.; Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2005)
      Do-All is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of trade-offs between ...
    • Article  

      Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2007)
      The abstract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iteratively to construct efficient simulations ...
    • Article  

      Obsessive-Compulsive Disorder in Adults with High-Functioning Autism Spectrum Disorder: What Does Self-Report with the OCI-R Tell Us? 

      Cadman, T.; Spain,D.; Johnston,Patrick; Russell, A.; Mataix-Cols, D.; Craig, Michael C.; Deeley, Q.; Robertson, D. M.; Murphy,Clodagh M.; Gillan, N.; Wilson, C. E.; Mendez, M.; Ecker,C.; Daly,Eileen M.; Findon, J.; Glaser, K.; Bailey, Anthony J.; Baron-Cohen,Simon; Bolton, P. F.; Bullmore,Edward T.; Carrington, S.; Chakrabarti,B.; Daly,Eileen M.; Deoni,Sean C. L.; Ecker,C.; Happé,Francesca; Henty, Julian; Jezzard, Peter; Johnston,Patrick; Jones, D. K.; Lombardo,Michael V.; Madden, A.; Mullins, D.; Murphy,Clodagh M.; Murphy,Declan G. M.; Pasco, Greg; Sadek,Susan A.; Spain,D.; Steward, R.; Suckling,John; Wheelwright,Sally J.; Williams,Steven C. R.; Happé,Francesca; Murphy,Clodagh M. (2015)
      Little is known about the symptom profile of obsessive-compulsive disorder (OCD) in individuals who have autism spectrum disorders (ASD). It is also unknown whether self-report questionnaires are useful in measuring OCD ...
    • Article  

      Work-competitive scheduling for cooperative computing with dynamic groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2005)
      The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
    • Conference Object  

      Work-competitive scheduling for cooperative computing with dynamic groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2003)
      The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...